Lebesgue type decompositions for nonnegative forms
نویسندگان
چکیده
منابع مشابه
Algorithms for Sparse Nonnegative Tucker Decompositions
There is a increasing interest in analysis of large-scale multiway data. The concept of multiway data refers to arrays of data with more than two dimensions, that is, taking the form of tensors. To analyze such data, decomposition techniques are widely used. The two most common decompositions for tensors are the Tucker model and the more restricted PARAFAC model. Both models can be viewed as ge...
متن کاملMaps on positive operators preserving Lebesgue decompositions
Let H be a complex Hilbert space. Denote by B(H)+ the set of all positive bounded linear operators on H. A bijective map φ : B(H)+ → B(H)+ is said to preserve Lebesgue decompositions in both directions if for any quadruple A,B,C,D of positive operators, B = C +D is an A-Lebesgue decomposition of B if and only if φ(B) = φ(C)+φ(D) is a φ(A)-Lebesgue decomposition of φ(B). It is proved that every ...
متن کاملNonnegative Ranks, Decompositions, and Factorizations of Nonnegative Matrices
The nonnegative rank of a nonnegative matrix is the smallest number of nonnegative rank-one matrices into which the matrix can be decomposed additively. Such decompositions are useful in diverse scientific disciplines. We obtain characterizations and bounds and show that the nonnegative rank can be computed exactly over the reals by a finite algorithm.
متن کاملProfile decompositions for critical Lebesgue and Besov space embeddings
Profile decompositions for “critical” Sobolev-type embeddings are established, allowing one to regain some compactness despite the non-compact nature of the embeddings. Such decompositions have wide applications to the regularity theory of nonlinear partial differential equations, and have typically been established for spaces with Hilbert structure. Following the method of S. Jaffard, we treat...
متن کاملClustering and Metaclustering with Nonnegative Matrix Decompositions
Although very widely used in unsupervised data mining, most clustering methods are affected by the instability of the resulting clusters w.r.t. the initialization of the algorithm (as e.g. in k-means). Here we show that this problem can be elegantly and efficiently tackled by meta-clustering the clusters produced in several different runs of the algorithm, especially if “soft” clustering algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Analysis
سال: 2009
ISSN: 0022-1236
DOI: 10.1016/j.jfa.2009.09.014